Data Structures & Algorithms
Dynamic Programming part 5, Sam's DP example 3: Buy and Sell Stock (3 choices)
March 14th, 2023
Dynamic Programming part 4, Sam's DP example 2: House Robber (2 choices)
March 12th, 2023
Dynamic Programming part 3, Sam's DP example 1: Climbing Stairs (2 choices)
March 10th, 2023
Dynamic Programming part 2: The Modern Law of Dynamic Programming (Sam's DP)
March 4th, 2023
Dynamic Programming part 1: the importance of Depth First Search in DP
February 25th, 2023
Backtracking
January 6th, 2023
Bellman-Ford
January 2nd, 2023
Topological Sort
December 29th, 2022
Depth First Search algorithm
November 24th, 2022
Breadth First Search algorithm
October 19th, 2022
Sliding Window algorithm
October 3rd, 2022
Two Pointers algorithm
September 14th, 2022
Sorting algorithms
September 7th, 2022
Divide and Conquer algorithm
August 25th, 2022
Greedy algorithm
August 15th, 2022
Binary Search algorithm
August 4th, 2022
Recursion, FOR/WHILE LOOP with some overhead
July 26th, 2022
FOR LOOP, a (almost) guaranteed, "brute force" solution
July 21st, 2022
What is an Algorithm?
June 14th, 2022
Graph Data Structure
January 15th, 2022
Tree data structure part 5/5: extracting useful information from tree using recursion: PreOrder, InOrder, PostOrder and more
July 18th, 2021
Tree data structure part 4/5: understanding function call stack and recursion
July 17th, 2021
Tree data structure part 3/5: extracting useful information out of tree using Loop, Stack and Queue
July 16th, 2021
Tree data structure part 2/5: balanced/unbalanced Binary Search Tree
July 15th, 2021
Tree data structure part 1/5: Tree and Binary Tree
July 14th, 2021
Linked List data structure
June 29th, 2021
Priority Queue data structure
June 25th, 2021
Queue data structure
June 24th, 2021
Stack data structure
June 20th, 2021
HashTable/HashMap/Map data structure
June 17th, 2021
Set data structure
June 6th, 2021
Array data structure
June 5th, 2021
String data structure
June 2nd, 2021
What is a data structure?
May 29th, 2021
Big O notation, an easy way to estimate the complexity of an algorithm
April 15th, 2021